Decomposed multi-objective bin-packing for virtual machine consolidation

نویسنده

  • Eli M. Dow
چکیده

In this paper, we describe a novel solution to the problem of virtual machine (VM) consolidation, otherwise known as VM-Packing, as applicable to Infrastructure-asa-Service cloud data centers. Our solution relies on the observation that virtual machines are not infinitely variable in resource consumption. Generally, cloud compute providers offer them in fixed resource allocations. Effectively this makes all VMs of that allocation type (or instance type) generally interchangeable for the purposes of consolidation from a cloud compute provider viewpoint. The main contribution of this work is to demonstrate the advantages to our approach of deconstructing the VM consolidation problem into a two-step process of multidimensional bin packing. The first step is to determine the optimal, but abstract, solution composed of finite groups of equivalent VMs that should reside on each host. The second step selects concrete VMs from the managed compute pool to satisfy the optimal abstract solution while enforcing anti-colocation and preferential colocation of the virtual machines through VM contracts. We demonstrate our high-performance, deterministic packing solution generation, with over 7,500 VMs packed in under 2 min. We demonstrating comparable runtimes to other VMmanagement solutions published in the literature allowing for favorable extrapolations of the prior work in the field in order to deal with larger VMmanagement problem sizes our solution scales to. Subjects Autonomous Systems, Operating Systems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Migration –A Leading Solution for Server Consolidation

Server consolidation of virtual machines is very much essential in a cloud environment for energy conservation and cost cutting . Consolidation can be achieved through live migration of virtual machines. We propose a modified bin packing algorithm for Server Consolidation that avoids unnecessary migrations and minimizes the instantiation of new physical servers. We implement ideas from the Firs...

متن کامل

Solving the Multi-Resource Bin Packing Problem with a Reordering Grouping Genetic Algorithm

We formally define multi-resource bin packing, a generalization of conventional bin packing, and develop an algorithm called Reordering Grouping Genetic Algorithm (RGGA) to solve this problem. Multi-resource bin packing can be applied to different problems, such as placing virtual machines onto servers. We first test RGGA on conventional bin packing problems and show that it yields excellent re...

متن کامل

Multi-level Grouping Genetic Algorithm for Low Carbon Virtual Private Clouds

Optimization problem of physical servers consolidation is very important for energy efficiency and cost reduction of data centers. For this type of problems, which can be considered as bin-packing problems, traditional heuristic algorithms such as Genetic Algorithm (GA) are not suitable. Therefore, other heuristic algorithms are proposed instead, such as Grouping Genetic Algorithm (GGA), which ...

متن کامل

A Generic Approach to Achieve Optimal Server Consolidation by Using Existing Servers in Virtualized Data Center

Virtualization-based server consolidation has been proven to be an ideal technique to solve the server sprawl problem by consolidating multiple virtualized servers onto a few physical servers leading to improved resource utilization and return on investment. In this paper, we solve this problem by using existing servers, which are heterogeneous and diversely preferred by IT managers. Five pract...

متن کامل

Approximability of Virtual Machine Allocation: Much Harder than Bin Packing

The allocation of virtual machines (VMs) to physical machines in data centers is a key optimization problem for cloud service providers. It is well known that the VM allocation problem contains the classic bin packing problem as special case. This paper investigates to what extent the existing approximability results on bin packing and its generalizations can be applied to the VM allocation pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • PeerJ Computer Science

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2016